An improved ant system algorithm for maximizing system reliability in the compatible module
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملAN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...
متن کاملan improved algorithm for network reliability evaluation
binary decision diagram (bdd) is a data structure proved to be compact in representation and efficient in manipulation of boolean formulas. using binary decision diagram in network reliability analysis has already been investigated by some researchers. in this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using cudd - colorado univer...
متن کاملAn Ant System Algorithm For Graph Bisection
This paper gives an algorithm for the graph bisection problem using the Ant System (AS) technique. The ant algorithm given in this paper differs from the usual ant algorithms in that the individual ant in the system does not construct a solution to the problem nor a component of the solution directly. Rather the collective behavior of the two species of ants in the system induces a solution to ...
متن کاملAn Ant System Algorithm for Coloring Graphs
This paper presents an ant system algorithm for the graph coloring problem. This ant system algorithm has several new features compared to previous ant system algorithms for the coloring problem. The main idea of the algorithm is for a colony of ants to color the graph, in which ants use its knowledge about the local neighborhood, recently visited nodes, and information stored at each vertex. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering (IJECE)
سال: 2019
ISSN: 2088-8708,2088-8708
DOI: 10.11591/ijece.v9i4.pp3232-3240